منابع مشابه
Dynamical vertex approximation for nanoscopic systems.
With an increasing complexity of nanoscopic systems and the modeling thereof, new theoretical tools are needed for a reliable calculation of complex systems with strong electronic correlations. To this end, we propose a new approach based on the recently introduced dynamical vertex approximation. We demonstrate its reliability already on the one-particle vertex (i.e., dynamical mean field theor...
متن کاملDynamical Tensor Approximation
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be viewed as a continuous-time updating procedure. This approach works with the increments rather than the full tensor and avoids the computation of decompositions of large matrices. In this method, the derivative is pro...
متن کاملDynamical Cluster Approximation
The dynamical cluster approximation (DCA) is a method which systematically incorporates nonlocal corrections to the dynamical mean-field approximation. Here we present a pedagogical discussion of the DCA by describing it as a ̊-derivable coarse-graining approximation in k-space, which maps an infinite lattice problem onto a periodic finite-sized cluster embedded in a self-consistently determine...
متن کاملDynamical Diophantine Approximation
Let μ be a Gibbs measure of the doubling map T of the circle. For a μ-generic point x and a given sequence {rn} ⊂ R, consider the intervals (T x − rn (mod 1), T x + rn (mod 1)). In analogy to the classical Dvoretzky covering of the circle we study the covering properties of this sequence of intervals. This study is closely related to the local entropy function of the Gibbs measure and to hittin...
متن کاملDynamical low-rank approximation
In low-rank approximation, separation of variables is used to reduce the amount of data in computations with high-dimensional functions. Such techniques have proved their value, e.g., in quantum mechanics and recommendation algorithms. It is also possible to fold a low-dimensional grid into a high-dimensional object, and use low-rank techniques to compress the data. Here, we consider low-rank t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress of Theoretical Physics Supplement
سال: 2008
ISSN: 0375-9687
DOI: 10.1143/ptps.176.117